Parsing natural language idioms with bidirectional finite-state machines

Parsing natural language idioms with bidirectional finite-state machines

Bidirectional Natural Language Parsing using Streams and Counterstreams

This thesis investigates the bidirectional exchange of information between linguistic and non-linguistic semantic inputs containing ambiguities. Such exchange is critical to Cognitively Complete Systems, in which collections of related representations and processes cooperate for their mutual problem-solving benefit. The exchange paradigm of reconciliation is defined, in which ambiguities and ga...

Finite-State Technology in Natural Language Processing

Finite-state technology is at the core of many standard approaches in natural language processing [1, 2]. However, the terminology and the notations differ significantly between theoretical computer science (TCS) [3] and natural language processing (NLP) [4]. In this lecture, inspired by [2, 4], we plan to illustrate the close ties between formal language theory as discussed in TCS and its use ...

Learning Finite State Machines "With

learn stable states by introducing discretization into the network and using a pseudogradient learning rule to perform training. The essense of the learning rule is that in doing gradient decent, it makes use of the gradient of a sigmoid function as a heuristic hint in place of that of the hard-limiting function, while still using the discretized value in the feedback update path. The new struc...

Finite State Machines with Datapath

Resent investigations have shown the very good results of digital systems and circuits optimization using integration of dynamic power management in the design flow. This approach proceed from detection periods of time during which parts of the circuit are not doing useful work and shut them down by either turning off the power supply or the clock signal. In this work, we take this approach to ...